The Euclidean algorithm is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder.
The LCM of two numbers can be futher computed in Euclid's approach by using GCD of A and B by - LCM(A, B) = (a * b) / GCD(A, B).